A Uniication-and Object-based Symbolic Computation System 1
نویسنده
چکیده
منابع مشابه
Matching and Uniication for the Object-oriented Symbolic Computation System
Term matching has become one of the most important primitive operations for symbolic computation. This paper describes the extension of the object-oriented symbolic computation system AlgBench with pattern matching and uniication facilities. The various pattern objects are organized in subclasses of the class of the composite expressions. This leads to a clear design and to a distributed implem...
متن کاملUniication-free Execution of Well-moded and Well-typed Prolog Programs 1
In this paper, a static analysis of Prolog programs has been proposed to improve the eeciency by replacing run-time uniication with matching. Programs for which run-time uniication can be replaced by matching are called uniication-free programs. We propose a set of suucient conditions for uniication-freedom improving the existing results and discuss the application of our results in improving W...
متن کاملCombining Uniication and Built-in Constraints (extended Abstract)
In less than a decade, Deduction with Constraints (DwC) has opened a new universe in computer science. DwC can be viewed from two perspectives: one related to the automated deduction framework 17, 19], the other to the development and usage of programming languages based on logic 7, 14]. Within the automated deduction framework, constraints on the generic data structure \terms" have become a po...
متن کاملNew structures of symbolic constraint objects : sets
1 Abstract A lot of work has been done up to now in designing Constraint Logic Programming Languages in order to solve combinatorial problems. Built-in computational domains in CLP support simple expression of problems and their eecient solution. Building a new computational domain comprising sets and graphs, this paper presents new symbolic constraints on set and graph structures in a CLP envi...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007